Gradual Encapsulation.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gradual Encapsulation

Strictly enforced encapsulation is a key concept for modular software designs. However, in many situations like unanticipated reuse, productivity can be raised by a more flexible approach to encapsulation. Also the discussion about the role of “obliviousness” in aspect-oriented programming is one instance of a general conflict between strictness and flexibility. Here, different technologies tak...

متن کامل

GRADUAL NORMED LINEAR SPACE

In this paper, the gradual real numbers are considered and the notion of the gradual normed linear space is given. Also some topological properties of such spaces are studied, and it is shown that the gradual normed linear space is a locally convex space, in classical sense. So the results in locally convex spaces can be translated in gradual normed linear spaces. Finally, we give an examp...

متن کامل

Gradual Typestate

Typestate reflects how the legal operations on imperative objects can change at runtime as their internal state changes. A typestate checker can statically ensure, for instance, that an object method is only called when the object is in a state for which the operation is welldefined. Prior work has shown how modular typestate checking can be achieved thanks to access permissions and state guara...

متن کامل

Gradual Abstract Proof Search

Gradual Abstract Proof Search (GAPS) is a new 2-player search technique. It has been used to prove that 11x11 Phutball is a win for the first player in 25 plies or less, that 6x6 Atari-Go with a crosscut in the center is a win for the first player in 15 plies or less. I give domain dependent optimizations for the two games. I also describe theoretical and experimental comparisons with other rel...

متن کامل

Efficient Gradual Typing

Gradual typing combines static and dynamic typing in the same program. One would hope that the performance in a gradually typed language would range between that of a dynamically typed language and a statically typed language. Existing implementations of gradually typed languages have not achieved this goal due to overheads associated with runtime casts. Takikawa et al. (2016) report up to 100×...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Object Technology

سال: 2008

ISSN: 1660-1769

DOI: 10.5381/jot.2008.7.9.a3